Nonexistence of a few binary orthogonal arrays

نویسندگان

  • Peter Boyvalenkov
  • Tanya Marinova
  • Maya Stoyanova
چکیده

We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations between the distance distributions of connected arrays. This turns out to be strong enough and we prove the nonexistence of binary orthogonal arrays of parameters (length, cardinality, strength) = (9, 6.2 = 96, 4), (10, 6.2, 5), (10, 7.2 = 112, 4), (11, 7.2, 5), (11, 7.2, 4) and (12, 7.2, 5), resolving the first cases where the existence was undecided so far. For the existing arrays our approach allows substantial reduction of the number of feasible distance distributions which could be helpful for classification results (uniqueness, for example).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonexistence of certain binary orthogonal arrays

We prove that binary orthogonal arrays of strength 8, length 12 and cardinality 1536 do not exist. This implies the nonexistence of arrays of parameters (strength,length,cardinality) = (n, n + 4, 6.2) for every integer n ≥ 8.

متن کامل

Nonexistence of ( 9 , 112 , 4 ) and ( 10 , 224 , 5 ) binary orthogonal arrays 1

Our approach is a natural continuation of the algorithm which is presented in [3]. We prove the nonexistence of BOAs of parameters (length, cardinality, strength) = (9, 7.2 = 112, 4) and (10, 7.2 = 224, 5), resolving two cases where the existence was undecided up to now.

متن کامل

On the existence of nested orthogonal arrays

A nested orthogonal array is an OA(N, k, s, g)which contains an OA(M, k, r, g) as a subarray. Here r < s andM<N . Necessary conditions for the existence of such arrays are obtained in the form of upper bounds on k, given N,M, s, r and g. Examples are given to show that these bounds are quite powerful in proving nonexistence. The link with incomplete orthogonal arrays is also indicated. © 2007 E...

متن کامل

β-galactosidase Production by Aspergillus niger ATCC 9142 Using Inexpensive Substrates in Solid-State Fermentation: Optimization by Orthogonal Arrays Design

Background: Enzymatic hydrolysis of lactose is one of the most important biotechnological processes in the food industry, which is accomplished by enzyme &beta;-galactosidase (&beta;-gal, &beta;-D-galactoside galactohydrolase, EC 3.2.1.23), trivial called lactase. Orthogonal arrays design is an appropriate option for the optimization of biotechnological processes for the production of microbial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 217  شماره 

صفحات  -

تاریخ انتشار 2017